منابع مشابه
A New Iterative Method For Solving Fuzzy Integral Equations
In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are valid.
متن کاملAn iterative method for solving a complex heat transfer problem
Conductive-radiative heat transfer in a scattering and absorbing medium bounded by two reflecting and radiating plane surfaces is considered. A diffusion model for describing heat transfer is examined. The theorems of existence and uniqueness of a solution of this problem are proved. An iterative procedure for solving radiative-conductive heat transfer problem is proposed.
متن کاملA Common Fixed Point Theorem Using an Iterative Method
Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...
متن کاملAN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...
متن کاملAn Overlapped Group Iterative Method for Solving Linear Systems
We propose a new iterative method for the numerical computation of the solution of linear systems of equations. The method is suited to problems exhibiting local dependencies. The technique can be envisaged as a generalization of the Gauss-Seidel point iterative method, being able to achieve greater convergence rates with, approximately, the same number of operations per iteration. On each iter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematics
سال: 1951
ISSN: 0003-486X
DOI: 10.2307/1969530